In March 2017, IBM launched the project IBM Q with the goal to provide accessto quantum computers for a broad audience. This allowed users to conductquantum experiments on a 5-qubit and, since June 2017, also on a 16-qubitquantum computer (called IBM QX2 and IBM QX3, respectively). In order to usethese, the desired quantum functionality (e.g. provided in terms of a quantumcircuit) has to properly be mapped so that the underlying physical constraintsare satisfied - a complex task. This demands for solutions to automatically andefficiently conduct this mapping process. In this paper, we propose such anapproach which satisfies all constraints given by the architecture and, at thesame time, aims to keep the overhead in terms of additionally required quantumgates minimal. The proposed approach is generic and can easily be configuredfor future architectures. Experimental evaluations show that the proposedapproach clearly outperforms IBM's own mapping solution. In fact, for manyquantum circuits, the proposed approach determines a mapping to the IBMarchitecture within less than five minutes (and within a fraction of a secondin most cases), while IBM's solution suffers from long runtimes and runs into atimeout of 1 hour in several cases. As an additional benefit, the proposedapproach yields mapped circuits with smaller costs (i.e. fewer additional gatesare required).
展开▼
